Integrality, complexity and colourings in polyhedral combinatorics
نویسنده
چکیده
Doctoral School: Mathematics Director: Miklós Laczkovich, Member of the Hungarian Academy of Sciences Doctoral Program: Applied Mathematics Director: György Michaletzky, Doctor of Sciences Advisor: András Frank, Doctor of Sciences, Professor Co-advisor: Tamás Király, Ph.D. Affiliation: Department of Operations Research, Eötvös Loránd University and Egerváry Research Group on Combinatorial Optimization, Budapest, Hungary
منابع مشابه
Polyhedral combinatorics: An annotated bibliography
The system Bx b is said to describe P , and each hyperplane fx 2 IR : B i x = big is called a cutting plane. One of the central questions in polyhedral combinatorics is to nd the cutting planes that describe P . This question is the subject of this chapter. We start with a section on books and collections of survey articles that treat polyhedral combinatorics in detail. x2 on integer programmin...
متن کاملA theory of 2-dipath colourings
We study colourings of oriented graphs in which vertices joined by a directed path of length two are assigned different colours. There are two models, depending on whether adjacent vertices must also be assigned different colours. In each case we describe a homomorphism model, a dichotomy theorem for the complexity of the problem of deciding whether there exists such a colouring with a fixed nu...
متن کاملPPAD-completeness of polyhedral versions of Sperner's Lemma
We show that certain polyhedral versions of Sperner’s Lemma, where the colouring is given explicitly as part of the input, are PPAD-complete. The proofs are based on two recent results on the complexity of computational problems in game theory: the PPAD-completeness of 2-player Nash, proved by Chen and Deng, and of Scarf’s Lemma, proved by Kintali. We show how colourings of polyhedra provide a ...
متن کاملPaths between colourings of sparse graphs
The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on exactly one vertex. We give a short proof of the following theorem of Bousquet and Perarnau (\emph{European Journal of Combinatorics}, 2016). Let $d$ and $k$ be positive integers, $k \geq d + 1$. For every $\eps...
متن کاملPolyhedral Combinatorics of Benzenoid Problems
Many chemical properties of benzenoid hydrocarbons can be understood in terms of the maximum number of mutually resonant hexagons, or Clar number, of the molecules. Hansen and Zheng (1994) formulated this problem as an integer program and conjectured, based on computational results, that solving the linear programming relaxation always yields integral solutions. We prove this conjecture showing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012